A stochastic particles model of fragmentation process with shattering
نویسندگان
چکیده
منابع مشابه
Shattering transitions in collision-induced fragmentation.
We investigate the kinetics of nonlinear collision-induced fragmentation. We obtain the fragment mass distribution analytically by utilizing its traveling wave behavior. The system undergoes a shattering transition in which a finite fraction of the mass is lost to infinitesimal fragments (dust). The nature of the shattering transition depends on the fragmentation process. When the larger of the...
متن کاملStochastic Coagulation-fragmentation Processes with a Finite Number of Particles and Applications
Coagulation-fragmentation processes describe the stochastic association and dissociation of particles in clusters. Cluster dynamics with cluster-cluster interactions for a finite number of particles has recently attracted attention especially in stochastic analysis and statistical physics of cellular biology, as novel experimental data are now available, but their interpretation remains challen...
متن کاملA Stochastic Model of Fragmentation in Dynamic Storage Allocation
We study a model of dynamic storage allocation in which requests for single units of memory arrive in a Poisson stream at rate A and are accommodated by the first available location found in a linear scan of memory. Immediately after this first-fit assignment, an occupied location commences an exponential delay with rate parameter/z, after which the location again becomes available. The set of ...
متن کاملMultifractality and the shattering transition in fragmentation processes.
We consider two simple geometric models that can describe the kinetics of fragmentation of two dimensional particles and stochastic fractals. We find a hierarchy of independent exponents suggesting the existence of multiple phase boundary for the shattering transition when two orthogonal cracks are placed randomly on a fragments (Model A). At the same time we find a unique exponent suggesting a...
متن کاملA Stochastic Process Model of Classical Search
Among classical search algorithms with the same heuristic information, with sufficient memory A* is essentially as fast as possible in finding a proven optimal solution. However, in many situations optimal solutions are simply infeasible, and thus search algorithms that trade solution quality for speed are desirable. In this paper, we formalize the process of classical search as a metalevel dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2015
ISSN: 1083-6489
DOI: 10.1214/ejp.v20-4060